Parameterised verification for multi-agent systems
نویسندگان
چکیده
منابع مشابه
Parameterised Verification of Data-aware Multi-Agent Systems
We introduce parameterised data-aware multiagent systems, a formalism to reason about the temporal properties of arbitrarily large collections of homogeneous agents, each operating on an infinite data domain. We show that their parameterised verification problem is semi-decidable for classes of interest. This is demonstrated by separately addressing the unboundedness of the number of agents and...
متن کاملAutomatic Verification of Multi-Agent Systems in Parameterised Grid-Environments
We present a framework for modeling and analysing multiple mobile agents on grid-environments such as finite mazes and labyrinths. Agents are modeled as automata, and the grid-environments are parameterised by their size and the relative positions of the obstacles. We study the verification problem, i.e., whether given agents complete a given task on a given (possibly infinite) set of grid-envi...
متن کاملAutomatic Verification of Parameterised Interleaved Multi-Agent Systems
A key problem in verification of multi-agent systems by model checking concerns the fact that the state-space of the system grows exponentially with the number of agents present. This often makes practical model checking unfeasible whenever the system contains more than a few agents. In this paper we put forward a technique to establish a cutoff result, thereby showing that systems with an arbi...
متن کاملVerifying Fault-tolerance in Parameterised Multi-Agent Systems
We develop a technique to evaluate the faulttolerance of a multi-agent system whose number of agents is unknown at design time. We present a method for injecting a variety of non-ideal behaviours, or faults, studied in the safety-analysis literature into the abstract agent templates that are used to generate an unbounded family of multiagent systems with different sizes. We define the parameter...
متن کاملVariable Structure Behavioural Controller for Multi-agent Systems
In previous papers authors have considered agents as inertia-less self driven particles and designed a flocking algorithm. Application of this algorithm to agents with considerable inertial characteristics needs a behavioural controller. The controller uses the local information and helps every agent to imitate the desired behaviour as a member of the flocking frame which covers the main is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2016
ISSN: 0004-3702
DOI: 10.1016/j.artint.2016.01.008